Sustainable Solutions for Dynamic Bargaining Problems
نویسنده
چکیده
By refering to the Bargaining Problem the economic literature means a situation in which a group of individuals seek to reach an agreement on a partition of a pie. Following Nash (1950) the two players bargaining problem is described using only two components (S, d) when d is a point in the plane which can be interpreted as the outcome when no agreement is reached and S is a compact convex subset of the plane which contains d and describes the set of all feasible utility payoffs that can be achieved by cooperation. Consequently two different bargaining problems that can be characterized by the same (S, d) will yield the same solution [see for example Nash (1950), Kalai and Smorodinsky (1975), and Kalai (1977)]. One approach to solve the bargaining problem is the axiomatic approach [for survey see Roth (1979)] in which the bargaining process is not specified and the assumptions are directly made on the solution itself. A different way of discussing the bargaining problem is the strategic approach in which the bargaining process itself is discussed [see Rubinstein (1982)]. In daily bargaining we deal quite often with a situation in which the
منابع مشابه
Stochastic Dynamic Programming with Markov Chains for Optimal Sustainable Control of the Forest Sector with Continuous Cover Forestry
We present a stochastic dynamic programming approach with Markov chains for optimal control of the forest sector. The forest is managed via continuous cover forestry and the complete system is sustainable. Forest industry production, logistic solutions and harvest levels are optimized based on the sequentially revealed states of the markets. Adaptive full system optimization is necessary for co...
متن کاملBargaining over multiple issues with maximin and leximin preferences
Global bargaining problems over a finite number of different issues are formalized as cartesian products of classical bargaining problems. For maximin and leximin bargainers we characterize global bargaining solutions that are efficient and satisfy the requirement that bargaining separately or globally leads to equivalent outcomes. Global solutions in this class are constructed from the family ...
متن کاملOrdinal Solutions to Bargaining Problems
A solution to bargaining problems is ordinal when it is covariant with order-preserving transformations of utility. Shapley (1969) has shown that there exists no ordinal, efficient, and symmetric solution to twoplayer bargaining problems, and has constructed such a solution to threeplayer problems. Here, Shapley’s solution is extended in two directions. First, it is shown how to construct an in...
متن کاملUsing Evolutionary Algorithms to study Bargaining Problems
The objective of this research is to tackle bargaining problems with Evolutionary Algorithms (EA). EA have been proved effective for a wide variety of problems. In this paper, we apply EA to solve Rubinstein’s Basic Alternating-Offer Bargaining Problem whose game-theoretic solution is known. Experimental outcomes suggest that EA are able to generate convincing approximations of the theoretic so...
متن کاملOrdinal invariance in multicoalitional bargaining
A multicoalitional bargaining problem is a non-transferable utility game and for each coalition, a bargaining rule. We look for ordinally invariant solutions to such problems and discover a subrule of Bennett’s (1997, Games Econ. Behav. 19, 151–179) that satisfies the property. On a subclass of problems that is closely related to standard bargaining problems and allocation problems with majorit...
متن کامل